A Job Shop Scheduling Problem with Sequence-Dependent Setup Times Considering Position-Based Learning Effects and Availability Constraints
Authors
Abstract:
Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. Due to learning effects, jobs processing times are not fixed during plan horizon and each machine has predetermined number of preventive maintenance activities. A novel mixed integer linear programming model is proposed to formulate the problem for minimizing Make Span. Owing to the high complexity of the problem; we applied Grey Wolf Optimizer (GWO) and Invasive Weed Optimizer (IWO) to find nearly optimal solutions for medium and large instances. Finally, the computational Results are provided for evaluating the performance and effectiveness of the proposed solution approaches.
similar resources
A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption
full text
Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
full textSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
full textSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
full textFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
full textThe Job-shop Scheduling Problem the Job-shop Scheduling Problem with Setup Times
This paper reports a bibliographical study and some personnal works about the general Jobshop Problem and Jobshop Problems with setup times. Section 1 introduces some { usual { notations about the general problem. Speciic notations concerning with setup times will be introduced later. The bibliograacal study, in Section 2 focuses on recent papers on both problems. Section 3 presents a general s...
full textMy Resources
Journal title
volume 30 issue 3
pages 329- 340
publication date 2019-09
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023